Distance Domination in Vertex Partitioned Graphs
نویسندگان
چکیده
We treat a variation of graph domination which involves partition ( V 1 , 2 ,..., k ) the vertex set G and each class i over distance d where all vertices edges may be used in process. Strict upper bounds extremal graphs are presented; results collected three handy tables. Further, we compare high number classes dominators needed.
منابع مشابه
Domination in partitioned graphs
Let V1, V2 be a partition of the vertex set in a graph G, and let γi denote the least number of vertices needed in G to dominate Vi. We prove that γ1 + γ2 ≤ 45 |V (G)| for any graph without isolated vertices or edges, and that equality occurs precisely if G consists of disjoint 5-paths and edges between their centers. We also give upper and lower bounds on γ1 + γ2 for graphs with minimum valenc...
متن کاملTotal Domination in Partitioned Graphs
We present results on total domination in a partitioned graph G = (V,E). Let γt(G) denote the total dominating number of G. For a partition V1, V2, . . . , Vk, k ≥ 2, of V , let γt(G;Vi) be the cardinality of a smallest subset of V such that every vertex of Vi has a neighbour in it and define the following ft(G;V1, V2, . . . , Vk) = γt(G) + γt(G;V1) + γt(G;V2) + . . .+ γt(G;Vk) ft(G; k) = max{f...
متن کاملMajority domination vertex critical graphs
This paper deals the graphs for which the removal of any vertex changes the majority domination number of the graph. In the following section, how the removal of a single vertex fromG can change the majority domination number is surveyed for trees. Characterisation of V + M (G) and V − M (G) are determined.
متن کاملPartitioned Graphs and Domination Related Parameters
Let G be a graph of order n ≥ 2 and n1, n2, .., nk be integers such that 1 ≤ n1 ≤ n2 ≤ .. ≤ nk and n1 + n2 + .. + nk = n. Let for i = 1, .., k: Ai ⊆ Kni where Km is the set of all pairwise non-isomorphic graphs of order m, m = 1, 2, ... In this paper we study when for a domination related parameter μ (such as domination number, independent domination number and acyclic domination number) is ful...
متن کاملDistance domination-critical graphs
A set D of vertices in a connected graph G is called a k-dominating set if every vertex in G − D is within distance k from some vertex of D. The k-domination number of G, γk(G), is the minimum cardinality over all k-dominating sets of G. A graph G is k-distance domination-critical if γk(G − x) < γk(G) for any vertex x in G. This work considers properties of k-distance domination-critical graphs...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Mathematica Pannonica
سال: 2022
ISSN: ['0865-2090']
DOI: https://doi.org/10.1556/314.2022.00006